Simple polygon

Results: 193



#Item
41CCCG 2009, Vancouver, BC, August 17–19, 2009  Open Problems from CCCG 2008 Erik D. Demaine∗  The following is a list of the problems presented on

CCCG 2009, Vancouver, BC, August 17–19, 2009 Open Problems from CCCG 2008 Erik D. Demaine∗ The following is a list of the problems presented on

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2009-09-02 14:31:48
42CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008  Polygons Folding to Plural Incongruent Orthogonal Boxes Ryuhei Uehara∗  Abstract

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Polygons Folding to Plural Incongruent Orthogonal Boxes Ryuhei Uehara∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:05:52
43CCCG 2010, Winnipeg MB, August 9–11, 2010  Visibility Maintenance of a Moving Segment Observer inside Polygons with Holes Hoda Akbari∗

CCCG 2010, Winnipeg MB, August 9–11, 2010 Visibility Maintenance of a Moving Segment Observer inside Polygons with Holes Hoda Akbari∗

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2010-07-19 10:46:16
44Testing Shortcuts to Maintain Simplicity in Subdivision Simplification Craig Falls Yuanxin Liu Jack Snoeyink University of North Carolina—Chapel Hill Chapel Hill, NC  Abstract

Testing Shortcuts to Maintain Simplicity in Subdivision Simplification Craig Falls Yuanxin Liu Jack Snoeyink University of North Carolina—Chapel Hill Chapel Hill, NC Abstract

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2005-07-31 13:55:53
45CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008  Open Problems from CCCG 2007 Erik D. Demaine∗  The following is a list of the problems presented on

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Open Problems from CCCG 2007 Erik D. Demaine∗ The following is a list of the problems presented on

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:00:35
46CCCG 2013, Waterloo, Ontario, August 8–10, 2013  An Optimal Algorithm Computing Edge-to-Edge Visibility in a Simple Polygon Mikkel Abrahamsen∗†

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 An Optimal Algorithm Computing Edge-to-Edge Visibility in a Simple Polygon Mikkel Abrahamsen∗†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2013-08-11 22:08:03
47CCCG 2007, Ottawa, Ontario, August 20–22, 2007  Generalized Watchman Route Problem with Discrete View Cost Pengpeng Wang∗,  Ramesh Krishnamurti †,

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Generalized Watchman Route Problem with Discrete View Cost Pengpeng Wang∗, Ramesh Krishnamurti †,

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:28:40
48CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008  Open Problems from CCCG 2007 Erik D. Demaine∗  The following is a list of the problems presented on

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Open Problems from CCCG 2007 Erik D. Demaine∗ The following is a list of the problems presented on

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:04:38
49CS 373: Combinatorial Algorithms, Fall 2000 Homework 1 (due November 16, 2000 at midnight) Name: Net ID:

CS 373: Combinatorial Algorithms, Fall 2000 Homework 1 (due November 16, 2000 at midnight) Name: Net ID:

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 08:48:13
50CCCG 2011, Toronto ON, August 10–12, 2011  The Possible Hull of Imprecise Points∗ William Evans†  Abstract

CCCG 2011, Toronto ON, August 10–12, 2011 The Possible Hull of Imprecise Points∗ William Evans† Abstract

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:13